Optimal Traffic Shaping with Deterministic Guarantees Using GPS Scheduling

نویسندگان

  • Enrique Hernández-Orallo
  • Joan Vila i Carbó
  • Sergio Saez
  • Silvia Terrasa
چکیده

The transmission of video over a high-speed network implies guaranteeing a Quality of Service (QoS). This transmission requires a very demanding reservation of network resources, so optimisation becomes a key issue. Traffic shaping has been proposed as a means for improving network utilisation. This paper introduces a fast and bounded method to obtain the leaky bucket shaper parameters that optimises network reservations (bandwidth and buffers) with deterministic guarantees using GPS scheduling. The algorithm presented finds the optimal solution in 5 or 6 iterations. Another important contribution of this paper is comparing this new admission scheme with different EDF control admission tests. Results show that although GPS is a little less efficient than the optimal EDF scheduler for one node (as expected), it is as efficient as the best RC-EDF known policies for several nodes, or even better when the number of network hops is high.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Traffic Shaping for End-to-End Delay Guarantees with EDF Scheduling

Abstract— The provision of Quality of Service (QoS) in terms of end-to-end delay guarantees to real-time applications is an important issue in emerging broadband packet networks. Of the various packet scheduling schemes that have been proposed in the literature, Earliest Deadline First (EDF) scheduling in conjunction with per-hop traffic shaping (jointly referred to as Rate-Controlled EDF or RC...

متن کامل

Deterministic end-to-end delay guarantees with rate controlled EDF scheduling

Quality of Service (QoS) in terms of end-to-end delay guarantees to real-time applications is an important issue in emerging broadband packet networks. Earliest Deadline First (EDF) scheduling, in conjunction with per-hop traffic shaping (jointly called Rate Controlled EDF or RC-EDF) has been recognised as an effective means of end-to-end deterministic delay provisioning. This paper addresses t...

متن کامل

Asymptotic Buffer Overflow Probabilities in Multiclass Multiplexers , Part I : The GPS Policy 1 Dimitris

In this paper and its sequel [BPT96] we consider a multiclass multiplexer, with segregated buffers for each type of traffic. Under specific scheduling policies for sharing bandwidth, we seek the asymptotic (as the buffer size goes to infinity) tail of the buffer overflow probability for each buffer. We assume dependent arrival and service processes as it is usually the case in models of bursty ...

متن کامل

On Adaptive Bandwidth Sharing with Rate Guarantees

The objective of recent research in fair queueing schemes has been to efficiently emulate a fluid-flow generalized (weighted) processor sharing (GPS) system, as closely as possible. A primary motivation for the use of fair-queueing has been its use as a means of providing bandwidth guarantees and as a consequence end-to-end delay bounds for traffic with bounded burstiness. The rate guarantees t...

متن کامل

Achieving High Utilization in Guaranteed Services Networks Using Early-Deadline-First Scheduling

Among packet-scheduling disciplines for providing end-toend Quality-of-Service (QoS) guarantees to different applications, including real-time services, two classes of algorithms have received particular attention: those based on Generalized Processor Sharing (GPS) and those based on Earliest Deadline First (EDF). One reason for the popularity of GPS-based schemes is that their powerful propert...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002